Detecting All Non-Dominated Points for Multi-Objective Multi-Index Transportation Problems
نویسندگان
چکیده
Multi-dimensional transportation problems denoted as multi-index are considered the extension of classical and appropriate practical modeling for solving real–world with multiple supply, demand, well different modes demands or delivering kinds commodities. This paper presents a method detecting complete nondominated set (efficient solutions) multi-objective four-index problems. The proposed approach implements weighted sum to convert problem into single objective problem, that can then be decomposed two-index sub-problems. For each sub-problem, parametric analysis was investigated determine range weights values keep efficient solution unchanged, which enable decision maker detect all solutions original also find stability first kind solution. Finally, an illustrative example is presented illustrate efficiency robustness approach. results demonstrate effectiveness solutions.
منابع مشابه
An Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملMulti-Objective Optimization for Multi-Product Multi-Period Four Echelon Supply Chain Problems Under Uncertainty
The multi-objective optimization for a multi-product multi-period four-echelon supply chain network consisting of manufacturing plants, distribution centers (DCs) and retailers each with uncertain services and uncertain customer nodes are aimed in this paper. The two objectives are minimization of the total supply chain cost and maximization of the average number of products dispatched to custo...
متن کاملNon-dominated Ranked Genetic Algorithm for Solving Constrained Multi-objective Optimization Problems
Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization problems, which typically require consideration of conflicting and competing design issues. A criticism of Evolutionary Algorithms might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search ...
متن کاملNon-dominated Ranked Genetic Algorithm for Solving Multi-objective Optimization Problems: Nrga
Multi-objective evolutionary algorithms (EAs) that use non-dominated sorting and sharing have been criticized. Mainly for their: 1) ( 3 MN O computational complexity (where M is the number of objectives and N is the population size). 2Non-elitism approach; 3-the need for specifying a sharing parameter. In this paper, a method combining the new Ranked based Roulette Wheel selection algorithm wit...
متن کاملA non-dominated sorting hybrid algorithm for multi-objective optimization of engineering problems
Among numerous multi-objective optimization algorithms, the Elitist non-dominated sorting genetic algorithm (NSGA-II) is one of the most popular methods due to its simplicity, effectiveness and minimum involvement of the user. This article develops a multi-objective variation of the Nelder-Mead simplex method and combines it with NSGA-II in order to improve the quality and spread of the solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2021
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su13031372